A (simplified) Bluetooth Maximum a Posteriori Probability (map) Receiver
نویسندگان
چکیده
In our software-defined radio project we aim at combining two standards: Bluetooth and HiperLAN/2. The HiperLAN/2 receiver requires the most computation power in comparison with Bluetooth. We choose to use this computational power also for Bluetooth and look for more advanced demodulation algorithms such as a Maximum A posteriori Probability (MAP) receiver. This paper discusses a simplified MAP receiver for Bluetooth GFSK signals. The Laurent decomposition provides an orthogonal vector space for the MAP receiver. As the first Laurent waveform contains the most energy we have used only this waveform for our (simplified) MAP receiver. This receiver requires a Eb N0 of about 11 dB for a BER of 10−3, required by the Bluetooth standard. This value is about 6 dB better than single bit demodulators. This performance will only be met if the receiver has exact knowledge of the modulation index.
منابع مشابه
A flexible WLAN receiver
Flexible radio receivers are also called Software Defined Radios (SDRs) [1], [2]. The focus of our SDR project [3] is on designing the front end, from antenna to demodulation in bits, of a flexible, multi-standard WLAN receiver. We try to combine an instance of a (G)FSK receiver (Bluetooth) with an OFDM receiver (HiperLAN/2). This paper focusses on the integration of the two receivers. The used...
متن کاملThe effect of the channel reliability factor in the MAP algorithm on turbo code performance in bluetooth systems
The effects of the channel reliability factor on the performance of turbo decoders that use a maximum a posteriori probability algorithm are investigated for wireless communication fading channels, such as Bluetooth systems. The channel reliability factor is related to the channel signal-to-noise ratio. For various values of the channel reliability factor, the obtained performance curves of the...
متن کاملDisparity Estimation Based on Bayesian Maximum A Posteriori (MAP) Algorithm∗
In this paper, a general formula of disparity estimation based on Bayesian Maximum A Posteriori (MAP) algorithm is derived and implemented with simplified probabilistic models. The formula is the generalized probabilistic diffusion equation based on Bayesian model, and can be implemented into some different forms corresponding to the probabilistic models in the disparity neighborhood system or ...
متن کاملNear Single User Performance using Iterative Multi-User Detection for CDMA with Turbo-Code Decoders
This paper discusses a code-division multiple access (CDMA) iterative multiuser receiver with forward error control (FEC) decoding. The maximum a-posteriori probability (MAP) criteria is used to derive the receiver. The decoding is done using a turbo-code decoder with modiications which are discussed. Iterations of the system are used to attain large performance improvements over conventional s...
متن کاملMaximum A Posteriori Decoding Algorithms For Turbo Codes
The symbol-by-symbol maximum a posteriori (MAP) known also as BCJR algorithm is described. The logarithmic versions of the MAP algorithm, namely, Log-MAP and Max-Log-MAP decoding algorithms along with a new Simplified-Log-MAP algorithm, are presented here. Their bit error rate (BER) performance and computational cornplexity of these algorithms are compared. A new hardware architecture for imple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003